Results and Problems on Saturation Numbers for Linear Forests
نویسندگان
چکیده
A graph G is called H-saturated if G contains no copy of H, but for any edge e in the complement of G, the graph G + e contains some copy of H. The minimum size of an n-vertex H-saturated graph is denoted by sat(n,H) and is called the saturation number of H. In [?], Kászonyi and Tuza determined the values of sat(n,H) when H is a path or a disjoint union of edges. In this paper, we determine the values of sat(n,H) for the disjoint union of paths (a linear forest) within a constant depending only on H . Moreover, we obtain exact values for some special classes and include several conjectures.
منابع مشابه
Some new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملApplication of different inverse methods for combination of vS and vGPR data to estimate porosity and water saturation
Inverse problem is one of the most important problems in geophysics as model parameters can be estimated from the measured data directly using inverse techniques. In this paper, applying different inverse methods on integration of S-wave and GPR velocities are investigated for estimation of porosity and water saturation. A combination of linear and nonlinear inverse problems are solved. Linear ...
متن کاملA New Approach to Solve Fully Fuzzy Linear Programming with Trapezoidal Numbers Using Conversion Functions
Recently, fuzzy linear programming problems have been considered by many. In the literature of fuzzy linear programming several models are offered and therefore some various methods have been suggested to solve these problems. One of the most important of these problems that recently has been considered; are Fully Fuzzy Linear Programming (FFLP), which all coefficients and variables of the prob...
متن کاملLaws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملA New Approach for Solving Fully Fuzzy Bilevel Linear Programming Problems
This paper addresses a type of fully fuzzy bilevel linear programming (FFBLP) wherein all the coefficients and decision variables in both the objective function and constraints are triangular fuzzy numbers. This paper proposes a new simple-structured, efficient method for FFBLP problems based on crisp bilevel programming that yields fuzzy optimal solutions with unconstraint variables and parame...
متن کامل